A modified Leverrier-Faddeev algorithm for matrices with multiple eigenvalues
نویسندگان
چکیده
منابع مشابه
An application of the modified Leverrier-Faddeev algorithm to the singular value decomposition of block-circulant matrices and the spectral decomposition of symmetric block- circulant matrices
The Leverrier-Faddeev algorithm, as modified by Gower (1980), is little-known but is useful for deriving the algebraic, rather than numerical, spectral structure of matrices occurring in statistical methodology. An example is given of deriving explicit forms for the singular value decomposition of any block-circulant matrix and the spectral decomposition of any symmetric block-circulant matrix....
متن کاملClassical orthogonal polynomials and Leverrier-Faddeev algorithm for the matrix pencils sE-A
which, in general, is a strictly proper rational matrix (see [1, 5] and references therein). The computation of (sE−A)−1 can be carried out by using the Cramer rule, which requires the evaluation of n2 determinants of (n− 1)× (n− 1) polynomial matrices. Clearly, this is not a practical procedure for large n. We will describe an extension of the classical Leverrier-Faddeev algorithm using famili...
متن کاملA mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملPerturbation of Multiple Eigenvalues of Hermitian Matrices
This paper is concerned with the perturbation of a multiple eigenvalue μ of the Hermitian matrix A = diag(μI, A22) when it undergoes an off-diagonal Email addresses: [email protected] (Ren-Cang Li), [email protected] (Yuji Nakatsukasa), [email protected] (Ninoslav Truhar), [email protected] (Wei-guo Wang) Supported in part by National Science Foundation Grants DMS-0810506 and DMS1115...
متن کاملAlmost Diagonal Matrices with Multiple or Close Eigenvalues
If A =D+E where D is the matrix of diagonal elements of A , then when A has some multiple or very close eigenvalues E has certain characteristic properties. These properties are considered both for hermitian and nonhermitian A . The properties are important in connexion with several algorithms for diagonalizing matrices by similarity transformations. *Mathematics Division, National Physical Lab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1980
ISSN: 0024-3795
DOI: 10.1016/0024-3795(80)90206-2